package org.nowcoder.leetcode.prefixSum;

import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * Title  : 437. Path Sum III
 * Source : https://leetcode.cn/problems/path-sum-iii/description/
 * Author : XrazYang
 * Date   : 2024-05-16
 */

public class LeetCode_437 {
    private class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode() {
        }

        TreeNode(int val) {
            this.val = val;
        }

        TreeNode(int val, TreeNode left, TreeNode right) {
            this.val = val;
            this.left = left;
            this.right = right;
        }
    }

    public int pathSum(TreeNode root, int targetSum) {

        return 0;
    }
}
